Method and apparatus for variable rate compression with a conditional autoencoder

ABSTRACT

A method and apparatus for variable rate compression with a conditional autoencoder is herein provided. According to one embodiment, a method includes training a conditional autoencoder using a Lagrange multiplier and training a neural network that includes the conditional autoencoder with mixed quantization bin sizes.

PRIORITY

This application is a Continuation of U.S. patent application Ser. No. 16/576,166, filed on Sep. 19, 2019, which claims priority under 35 U.S.C. § 119(e) to U.S. Provisional patent application filed on Mar. 18, 2019 in the United States Patent and Trademark Office and assigned Ser. No. 62/820,148, and to U.S. Provisional patent application filed on Jun. 12, 2019 in the United States Patent and Trademark Office and assigned Ser. No. 62/860,522, the entire contents of which are incorporated herein by reference.

FIELD

The present disclosure is generally related to data compression. In particular, the present disclosure is related to a method and apparatus compression using a conditional autoencoder.

BACKGROUND

Variable rate compression may utilize neural network functionality and may be applied in various fields, including but not limited to image compression and radio frequency integrated circuit (RFIC) output compression.

Image compression is an application of data compression for digital images to lower their storage and/or transmission requirements. Transform coding may be used to yield image compression algorithms such as Joint Photographic Experts Group (JPEG) and JPEG2000. Such transform coding converts an input to a latent representation in a transform domain where lossy compression (that is typically a combination of quantization and lossless source coding) is more amenable and more efficient. For example, JPEG utilizes the discrete cosine transform (DCT) to convert an image into a sparse frequency domain representation. JPEG2000 replaces DCT with an enhanced discrete wavelet transform.

Deep learning may provide improved performance in various computer vision tasks. Along with this revolutionary progress of deep learning, learning-based image compression also has gained interests. In particular, non-linear transform coding designed with deep neural networks has advanced to outperform the classical image compression codecs sophisticatedly designed and optimized by domain experts, e.g., better portable graphics (BPG), which is a still image version of the high efficiency video codec (HEVC) standard. Typical learning-based image compression schemes provide BPG codec on peak signal-to-noise ratio (PSNR), a metric based on mean squared error (MSE).

A typical autoencoder based image compression framework optimizes the weighted combination of the rate-distortion (R-D) pair using the method of Lagrange multipliers. To adapt the quality (or the rate) of compressed images, multiple models are trained separately for different values of the Lagrange multiplier. That is, a typical system trains and deploys multiple models for rate adaptation, or retains a model while varying Lagrange multiplier, which may be impractical when it is desired to cover a broad range of the R-D curve with fine resolution and the size of each network is large.

SUMMARY

According to one embodiment, a method includes training a conditional autoencoder using a Lagrange multiplier and training a neural network that includes the conditional autoencoder with mixed quantization bin sizes.

According to one embodiment, a system includes a neural network including a conditional autoencoder, and a processor configured to train the conditional autoencoder using a Lagrange multiplier and train the neural network using mixed quantization bin sizes.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certain embodiments of the present disclosure will be more apparent from the following detailed description, taken in conjunction with the accompanying drawings, in which:

FIG. 1A illustrates a diagram of a variable-rate image compression model, according to an embodiment;

FIG. 1B illustrates a diagram of a variable-rate image compression model, according to an embodiment;

FIG. 2 illustrates a flowchart of a method for compression, according to an embodiment;

FIG. 3 illustrates a diagram of a conditional autoencoder, according to an embodiment;

FIG. 4 illustrates a diagram of a refined variable-rate compression model, according to an embodiment;

FIG. 5 illustrates a diagram of a system for radio frequency integrated circuit (RFIC) analog-to-digital output compression, according to an embodiment;

FIG. 6 illustrates a conditional encoder, according to an embodiment;

FIG. 7 illustrates a conditional encoder, according to an embodiment;

FIG. 8 illustrates a conditional entropy model, according to an embodiment;

FIG. 9 illustrates a conditional entropy model, according to an embodiment;

FIG. 10 illustrates a conditional decoder, according to an embodiment;

FIG. 11 illustrates a conditional decoder, according to an embodiment; and

FIG. 12 illustrates a block diagram of an electronic device in a network environment, according to one embodiment.

DETAILED DESCRIPTION

Hereinafter, embodiments of the present disclosure are described in detail with reference to the accompanying drawings. It should be noted that the same elements will be designated by the same reference numerals although they are shown in different drawings. In the following description, specific details such as detailed configurations and components are merely provided to assist with the overall understanding of the embodiments of the present disclosure. Therefore, it should be apparent to those skilled in the art that various changes and modifications of the embodiments described herein may be made without departing from the scope of the present disclosure. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness. The terms described below are terms defined in consideration of the functions in the present disclosure, and may be different according to users, intentions of the users, or customs. Therefore, the definitions of the terms should be determined based on the contents throughout this specification.

The present disclosure may have various modifications and various embodiments, among which embodiments are described below in detail with reference to the accompanying drawings. However, it should be understood that the present disclosure is not limited to the embodiments, but includes all modifications, equivalents, and alternatives within the scope of the present disclosure.

Although the terms including an ordinal number such as first, second, etc. may be used for describing various elements, the structural elements are not restricted by the terms. The terms are only used to distinguish one element from another element. For example, without departing from the scope of the present disclosure, a first structural element may be referred to as a second structural element. Similarly, the second structural element may also be referred to as the first structural element. As used herein, the term “and/or” includes any and all combinations of one or more associated items.

The terms used herein are merely used to describe various embodiments of the present disclosure but are not intended to limit the present disclosure. Singular forms are intended to include plural forms unless the context clearly indicates otherwise. In the present disclosure, it should be understood that the terms “include” or “have” indicate existence of a feature, a number, a step, an operation, a structural element, parts, or a combination thereof, and do not exclude the existence or probability of the addition of one or more other features, numerals, steps, operations, structural elements, parts, or combinations thereof.

Unless defined differently, all terms used herein have the same meanings as those understood by a person skilled in the art to which the present disclosure belongs. Terms such as those defined in a generally used dictionary are to be interpreted to have the same meanings as the contextual meanings in the relevant field of art, and are not to be interpreted to have ideal or excessively formal meanings unless clearly defined in the present disclosure.

The electronic device according to one embodiment may be one of various types of electronic devices. The electronic devices may include, for example, a portable communication device (e.g., a smart phone), a computer, a portable multimedia device, a portable medical device, a camera, a wearable device, or a home appliance. According to one embodiment of the disclosure, an electronic device is not limited to those described above.

The terms used in the present disclosure are not intended to limit the present disclosure but are intended to include various changes, equivalents, or replacements for a corresponding embodiment. With regard to the descriptions of the accompanying drawings, similar reference numerals may be used to refer to similar or related elements. A singular form of a noun corresponding to an item may include one or more of the things, unless the relevant context clearly indicates otherwise. As used herein, each of such phrases as “A or B,” “at least one of A and B,” “at least one of A or B,” “A, B, or C,” “at least one of A, B, and C,” and “at least one of A, B, or C,” may include all possible combinations of the items enumerated together in a corresponding one of the phrases. As used herein, terms such as “1^(st),” “2nd,” “first,” and “second” may be used to distinguish a corresponding component from another component, but are not intended to limit the components in other aspects (e.g., importance or order). It is intended that if an element (e.g., a first element) is referred to, with or without the term “operatively” or “communicatively”, as “coupled with,” “coupled to,” “connected with,” or “connected to” another element (e.g., a second element), it indicates that the element may be coupled with the other element directly (e.g., wired), wirelessly, or via a third element.

As used herein, the term “module” may include a unit implemented in hardware, software, or firmware, and may interchangeably be used with other terms, for example, “logic,” “logic block,” “part,” and “circuitry.” A module may be a single integral component, or a minimum unit or part thereof, adapted to perform one or more functions. For example, according to one embodiment, a module may be implemented in a form of an application-specific integrated circuit (ASIC).

Variable rate compression may utilize neural network functionality and may be applied in various fields, including but not limited to image compression and radio frequency integrated circuit (RFIC) output compression.

According to one embodiment, the present system and method provides a single variable-rate image compression network that performs rate adaptation. In particular, the network includes a conditional autoencoder, conditioned on a Lagrange multiplier (i.e., the network takes the Lagrange multiplier as an input and produces a latent representation whose compression rates (e.g., bits per pixel (BPP) in image compression) depend on the input value. Moreover, the network is trained with mixed quantization bin sizes which allows for adaptation of the compression rate by adjusting the bin size applied to the quantization of a latent representation. Coarse compression rate adaptation to a target is achieved by varying the Lagrange multiplier in the conditional model, while fine compression rate adaptation is done by tuning the quantization bin size.

FIG. 1A illustrates a diagram of a variable-rate image compression model 100, according to an embodiment. A model 100 includes a conditional autoencoder 102, a conditional decoder 104, and a conditional entropy model 106. The autoencoder 102 is conditioned on the Lagrange multiplier λ 108 that adapts the compression rate and optimizes the rate-distortion Lagrangian for various λ values in one conditional model. The model 100 is trained for mixed values of the quantization bin size Δ 110 with universal quantization 111 so that the compression rate can be varied by changing Δ 110. The multiplier 108 is utilized in both the conditional entropy model 106 and the conditional decoder 104. The model 100 utilizes entropy encoding 112 and entropy decoding 114.

The present conditional autoencoder 102 receives a hyper-parameter (i.e., the Lagrange multiplier λ 108) of the optimization problem as its conditioning variable. The present system and method solves multiple objectives using one conditional network, instead of solving the objectives individually using separate, non-conditional networks. The model 100 is based on a conditional autoencoder that does not need multiple iterations, while the quality is controlled by its conditioning variables λ 108 and Δ 110.

FIG. 1B illustrates a diagram of a variable-rate image compression model 150, according to an embodiment. The model 150 includes a first conditional auto encoder 152, a second conditional auto encoder 154, a first conditional entropy model 156, a second conditional entropy model 158, a first conditional auto decoder 160 and a second conditional auto decoder 162. The model 150 also includes a first universal quantization function 164 and a second universal quantization function 166, as well as a first arithmetic encoding (AE)/decoding (AD) function 168 and a second AE/AD function 170. The hyperparameter 172 is utilized at the universal quantization functions 164 and 166 as is described below

With a autoencoder architecture including an encoder f_(ϕ)(x) and a decoder g_(θ)(z), where x is an input range and z=round_(Δ)(f_(ϕ)(x)) is a quantized latent representation encoded from the input x with a quantization bin size Δ, where round_(Δ)(x)=Δround(x/Δ). In the Equations below, Δ is fixed at 1. Lossless entropy source coding is used to generate a compressed bitstream from the quantized representation z. Taking the entropy source coding for the quantized latent variable z, and achieving its entropy rate, the compression rate R and the L2 distortion D (i.e., the MSE loss) are given by Equation (1):

$\begin{matrix} {{R_{\phi} = {\sum\limits_{z}{{- {P_{\phi}(z)}}\log_{2}{P_{\phi}(z)}}}},{D_{\phi,\theta} = {E_{p{(x)}}\left\lbrack {{x - {g_{\theta}\left( {roun{d_{\Delta}\left( {f_{\phi}(x)} \right)}} \right)}}} \right\rbrack}}} & (1) \end{matrix}$

where as in Equation (2): P _(ϕ)(z)=∫p(x)δ(z−round_(Δ)(f _(ϕ)(x)))dx  (2)

and p(x) is the probability density function of all natural images, and P_(ϕ)(z) is the probability mass function of z induced from encoder f_(ϕ)(x) and round_(Δ), which satisfies Equation (2), where δ denotes the Dirac delta function. Using the method of Lagrange multipliers, the R-D optimization problem is expressed as Equation (3):

$\begin{matrix} {\min\limits_{\phi,\theta}\left\{ {D_{\phi,\theta} + {\lambda\; R_{\phi}}} \right\}} & (3) \end{matrix}$

for a fixed Lagrange multiplier λ>0. The compression rate and the distortion provided in Equation (1) are not differentiable for network parameter ϕ, due to P_(ϕ)(z) and round_(Δ), and thus it is not straightforward to optimize Equation (3).

According to one embodiment, the present system uses universal quantization. Universal quantization dithers every element in a latent representation f_(ϕ)(x) with one common uniform random variable as in Equation (4): z=round_(Δ)(f _(ϕ)(x)+u)−u, u=[U,U, . . . ,U]  (4)

where the dithering vector u includes repetitions of a single uniform random variable U with support [−Δ/2, Δ/2]. The universal quantization is approximated as a linear function of the unit slope in the backpropagation of the network training. In each dimension, universal quantization is effectively identical in distribution to adding uniform noise, although the noise induced from universal quantization is dependent across dimensions.

Under the relaxation with universal quantization, similar to Equation (1), the compression rate and the distortion can be expressed as Equation (5): R _(ϕ) =E _(p(x)p) _(ϕ) _((z|x))[−log₂ p _(ϕ)(z)], D _(ϕ,θ) =E _(p(x)p) _(ϕ) _((z|x))[∥x−g _(θ)(round_(Δ)(f _(ϕ)(x)))|₂ ²]  (5)

where p_(ϕ)(z)=∫p(x)p_(θ)(z|x)dx. The compression rate is now a differential entropy, which is differentiable, but it is still usually intractable to compute p_(ϕ)(z). A tractable density function q_(θ)(z) is introduced and Equation (6) is derived as:

$\begin{matrix} \begin{matrix} {R_{\phi} = {E_{{p{(x)}}{p_{\phi}{({z|x})}}}\left\lbrack {{- \log_{2}}{p_{\phi}(z)}} \right\rbrack}} \\ {= {{E_{{p{(x)}}{p_{\phi}{({z|x})}}}\left\lbrack {{- \log_{2}}{q_{\theta}(z)}} \right\rbrack} - {K{L\left( {p_{\phi}(z)}||{q_{\theta}(z)} \right)}}}} \\ {{\leq {E_{{p{(x)}}{p_{\phi}{({z|x})}}}\left\lbrack {{- \log_{2}}{q_{\theta}(z)}} \right\rbrack}}\overset{\Delta}{=}R_{\phi,\theta}} \end{matrix} & (6) \end{matrix}$

where KL denotes Kullback-Leibler divergence. The equality holds when p_(ϕ)(z)=q_(θ)(z). Approximating R_(ϕ) by its upperbound R_(ϕ,θ), the R-D optimization in Equation (3) reduces to Equation (7):

$\begin{matrix} {\min\limits_{\phi,\theta}{E_{{p{(x)}}{p_{\phi}{({z|x})}}}\left\lbrack {{{x - {g_{\theta}(z)}}}_{2}^{2} - {{\lambda log}_{2}{q_{\theta}(z)}}} \right\rbrack}} & (7) \end{matrix}$

for fixed λ>0. By optimizing a network for different values of λ, quality can be traded off against the compression rate. Using a smaller Lagrange multiplier λ, the trained network yields higher-quality images while using larger rates.

To adapt the quality and the compression rate of the compressed images, the system needs to optimize the R-D Lagrange function in Equation (7) for varying values of the Lagrange multiplier λ. Disclosed herein is a variable-rate model that can be deployed once and can be used to produce compressed images of varying quality with different rates, depending on the user's requirements, with no need of re-training.

FIG. 2 illustrates a flowchart 200 of a method for compression, according to an embodiment. At 202, the system trains a conditional autoencoder. The system may train the conditional autoencoder conditioned on the Lagrange multiplier λ. The network receives λ as a conditioning input parameter, along with the input image, and produces a compressed image with varying compression rate and distortion depending on the conditioning value of λ. Thus, the compression rate and distortion terms in Equations (5) and (6) are altered into Equations (8) and (9): R _(ϕ,θ)(λ)=E _(p(x)p) _(ϕ) _((z|x,λ))[−log₂ p _(ϕ)(z|λ)]  (8) D _(ϕ,θ)(λ)=E _(p(x)p) _(ϕ) _((z|x,λ))[∥x−g _(ϕ)(z,λ)∥₂ ²]  (9)

for λ∈∧, where ∧ is a pre-defined finite set of Lagrange multiplier values. Then, the combined objective function of Equation (10) is minimized.

$\begin{matrix} {\min\limits_{\phi,\theta}{\sum\limits_{\lambda \in \Lambda}\left( {{D_{\phi,\theta}(\lambda)} + {\lambda\;{R_{\phi}(\lambda)}}} \right)}} & (10) \end{matrix}$

FIG. 3 illustrates a diagram of a conditional autoencoder 300, according to an embodiment. To implement the conditional autoencoder, the conditional convolution is developed, conditioned on the Lagrange multiplier. The system sends the input 302 through a convolution layer 304 while the system sends the multiplier λ 306 through a one-hot encoding layer 308, the output of which is then split as an input to a first fully-connected layer 310 and a second fully-connected layer 312. The system sends the output of the first fully-connected layer 310 to a softplus function block 314, the output of which is multiplied at 316 with the output of the convolution layer 304. The system then accumulates the multiplied output 318 and the output from the fully-connected layer 312 with the adder 319 to produce the output 320. The convolution is conditioned on the Lagrange multiplier λ 306, which produces a different output depending on the input Lagrange multiplier λ 306.

Specifically, referring to FIG. 3, X_(i) is a 2-D input of channel i, Y_(j) is a 2-D output of channel j, and W_(i,j) is a 2-D convolutional kernel for input channel i and output channel j. The conditional convolution is given by Equation (11):

$\begin{matrix} {Y_{j} = {{{s_{j}(\lambda)}{\sum\limits_{i}{X_{i}*W_{i,j}}}} + {b_{j}(\lambda)}}} & (11) \end{matrix}$

where * denotes 2-D convolution. The channel-wise scaling factor and the additive bias term depend on λ as in Equation (12): s _(j)(λ)=softplus(u _(j) ^(T) onehot(λ)), b _(j)(λ)=v _(j) ^(T) onehot(λ)  (12)

where u_(j) ^(T) and v_(j) ^(T) are the fully-connected layer weight vectors of length |∧| for output channel j, T denotes the transpose, and onehot(λ) is one-hot encoding of λ over ∧.

Referring to FIG. 2, at 204, the system trains the network with mixed quantization bin sizes. The above conditional autoencoder can obtain only finite discrete points in the R-D curve, since λ is selected from a pre-determined finite set ∧. To extend the coverage to the whole continuous range of the R-D curve, another controlling aspect in the network is included to control the compression rate, i.e., the quantization bin size. In the R-D formulation in Equation (1), the quantization bin size was fixed to Δ=1 (i.e., round was used for quantization). In actual inference, the bin size can be changed to adapt the compression rate, such that the larger the bin size, the lower the compression rate. However, the performance naturally suffers from mismatched bin sizes in training and inference, thus the system trains the network with mixed bin sizes.

During training, the system draws a uniform noise for various noise levels (for random Δ). The range of Δ and the mixing distribution within the range are design choices. In one example, Δ=2^(b) was utilized, where b is uniformly drawn from [−1,1] so Δ∈[0.5,2] is covered. The larger the range of b, the broader range of the R-D curve the network can be optimized for, although the performance may degrade. The optimization is solved as in Equation (13):

$\begin{matrix} {\min\limits_{\phi,\theta}{\sum\limits_{\lambda \in \Lambda}{E_{p{(\Delta)}}\left\lbrack {{D_{\phi,\theta}\left( {\lambda,\Delta} \right)} + {\lambda\;{R_{\phi}\left( {\lambda,\Delta} \right)}}} \right\rbrack}}} & (13) \end{matrix}$

where p(Δ) is a pre-defined mixing density of Δ, and as in Equation (14). R _(ϕ,θ)(λ,

)=E _(p(x)p) _(ϕ) _((z|x,λ,Δ))[−log₂ p _(ϕ)(z|λ,

)], D _(ϕ,θ)(λ,

)=E _(p(x)p) _(ϕ) _((z|x,λ,Δ))[∥x−p _(ϕ)(z,λ)∥₂ ²]  (14)

Referring to FIG. 2, at 206, the system performs inference. Regarding compression rate adaptation, the compression rate increases as the Lagrange multiplier and/or the quantization bin size decreases. Given a user's target compression rate, the system achieves large-scale discrete compression rate adaptation by changing the Lagrange multiplier, while the system can perform fine continuous compressionrate adaptation by adjusting the quantization bin size for a fixed Lagrange multiplier.

Regarding compression, after selecting λ∈∧, the system performs one-hot encoding of the Lagrange multiplier and uses it in all conditional convolutional layers to encode a latent representation of the input. The system performs regular deterministic quantization on the encoded representation with the selected quantization bin size. The system then encodes the quantized latent representation into a compressed bitstream with entropy encoding while storing the values of the conditional variables used in encoding.

Regarding decompression, the system decodes the compressed bitstream and retrieves the conditioning variables used in encoding from the compressed bitstream. The system restores the quantized latent representation from the decoder integer values by multiplying them with the quantization bin size. The system then feeds the restored latent representation to the decoder to reconstruct the image. The value of the Lagrange multiplier used in encoding is again used in all deconvolutional layers for conditional generation.

FIG. 4 illustrates a diagram of a refined variable-rate compression model, according to an embodiment. In FIG. 4, an encoder 400 and a decoder 402 are depicted. The system refines the probability model by introducing a secondary latent variable w 404 that depends on x 406 and z 408. The rate and distortion terms given in Equation (13) are then given by Equation (14). R _(ϕ,θ)(λ,

)=E _(p(x)p) _(ϕ) _((z|x,λ,Δ)p) _(ϕ) _((w|z,x,λ,Δ))[−log₂ q _(ϕ)(w|λ,Δ)q _(ϕ)(z|w,λ,Δ)], D _(ϕ,θ)(λ,Δ)=E _(p(x)p) _(ϕ) _((z|x,λ,Δ)p) _(ϕ) _((w|z,x,λ,Δ))[∥x−g _(θ)(z,w,λ)∥₂ ²]  (14)

For compression, the system encodes z 408 from x 406, and the further encodes w 404 from z(408),x(406). The encoded representations z 408, w 404 are entropy coded based on q_(ϕ)(w|λ, Δ) and q_(ϕ)(z|w, λ, Δ), respectively. For decompression, given q_(ϕ)(w|λ, Δ), the system decodes w 404, which is then used to compute q_(ϕ)(z|w, λ, Δ) and to decode z 408. This model is further refined by introducing autoregressive models for q_(ϕ)(w|λ, Δ) and q_(ϕ)(z|w, λ, Δ), as shown in Equation (15).

$\begin{matrix} {{{q_{\phi}\left( {\left. w \middle| \lambda \right.,\Delta} \right)} = {\prod\limits_{i}{q_{\phi}\left( {\left. w_{i} \middle| w_{< i} \right.,\lambda,\Delta} \right)}}},{{q_{\phi}\left( {\left. z \middle| w \right.,\lambda,\Delta} \right)} = {\prod\limits_{i}{q_{\phi}\left( {\left. z_{i} \middle| Z_{< i} \right.,w,\lambda,\Delta} \right)}}}} & (15) \end{matrix}$

The system replaces a lossless source coding part of the encoded representations with lossy compress to adapt the rate. It is noted that any type of lossy compression codec may be used, including, but not limited to better portable graphics (BPG). By using lossy compression instead of lossless compression of encoded feature maps, the system may fine-tune the decoder for the lossy compression outputs to improve accuracy.

For BPG lossy compression, the system may rearrange the encoded feature maps into one gray-scale image. The system further compresses the rearranged gray-scale image as BPG lossy compression. For decompression, the system decompresses the feature maps from BPG, and then passes the decompressed feature maps to the decoder to get the decompressed image.

According to another embodiment, the system and method may be applied to a domain of wireless communication chipsets.

FIG. 5 illustrates a diagram of a system 500 for RFIC ADC output compression, according to an embodiment. The system includes an RFIC 502, a variable-rate compression network 504, a baseband modem 506, and a lookup table 508. The system adapts the compression rate (e.g., bits/subframe, bits/frame, bits/slot, etc.) based on a modulation coding scheme (MCS) 510, which is determined by the operating signal-to-noise ratio (SNR). The system may select the conditioning variables λ, Δ as a function of a MCS, which determines the compression rate and the distortion. Here, the distortion level may be below the operating SNR in order to avoid any performance degradation owing to compression. The system may include a lookup table 508 that maps MCS to λ, Δ.

The system may apply the present variable-rate compression scheme to compress an analog-to-digital converter (ADC) 502 output of a radio frequency integrated circuit (RFIC). The system may compress the ADC 502 output with the compression network 504, and pass the compressed ADC output to a baseband (BB) modem 506 to reduce the communication cost (i.e., the bandwidth and/or the number of lanes) between RFIC and BB. The compression may be performed on every slot, every subframe, or every frame, depending on the affordable bandwidth and delay

FIG. 6 illustrates a first conditional encoder 600, according to an embodiment. The conditional encoder 600 may be similar to the conditional encoder 102 depicted in FIG. 1A and the conditional encoder 152 depicted in FIG. 1B. An input (e.g., an image, ADC output, etc) 602 is provided the system processes the input 902 through a first 192×5×5/2 conditional convolution layer 604, a first generalized divisive normalization (GDN) layer 606, a second 192×5×5/2 conditional convolution layer 608, a second GDN layer 610, a third 192×5×5/2 conditional convolution layer 612, a third GDN layer 614, a 984×5×5/2 conditional convolution layer 616, and a universal quantization (UnivQuant) layer 610, which produces an output 820. The third GDN layer 614 produces an output 622 that is sent to a 192×5×5/2 conditional convolution layer 624, then to a leaky ReLU activation function 626, which produces an output 628.

FIG. 7 illustrates a second conditional encoder 700, according to an embodiment. The second conditional encoder 700 may be similar to the conditional encoder 154 depicted in FIG. 1B. A concatenation (Concat) layer 702 receives the output 620 and the output 628, and the system produces an output that is processed by a 192×3×3/2 conditional convolution layer 704, a first leaky ReLU activation function 706, a first 192×5×5/2 conditional convolution layer 708, a second leaky ReLU activation function 710, a second 192×5×5/2 conditional convolution layer 712, and a UnivQuant layer 714, which produces an output 716.

FIG. 8 illustrates a conditional entropy model 800, according to an embodiment. The entropy model 800 may be the same or similar to the conditional entropy model 158 depicted in FIG. 1B. The entropy model 800 receives the output 716 which is processed through an AE 802 and an AD 804. The entropy model 800 processes the output 716 through a masked 384×5×5/1 conditional convolution layer 806, a 640×1×1/1 conditional convolution layer 808, a first leaky ReLU activation function 810, a 812×1×1/1 conditional convolution layer 812, and a second leaky ReLU activation function 814. The output of the ReLU function 814 is processed through a first 192×1×1/1 conditional convolution layer 816 as well as a second 192×1×1/1 conditional convolution layer 818. The output of the second conditional convolution layer 818 is processed through a third ReLU activation function 820, and the output of the first conditional convolution layer 816 and the ReLU function 820 are processed to produce the Gaussian model 822. The Gaussian model 822 is utilized with the AE 802 and the AD 804 to produce the output 826.

FIG. 9 illustrates a conditional entropy model 900, according to an embodiment. The conditional entropy model 900 may be similar to the conditional entropy model 106 depicted at FIG. 1A and the conditional entropy model 156 illustrated in FIG. 1B. A masked 768×5×5/1 conditional convolution layer 914 receives input 826 and produces output 916. Furthermore, the system receives the output 826 and processes it through 684×5×5/2 conditional convolution layer 902, a first leaky ReLU activation function 904, a 576×5×5/2 conditional convolution layer 906, a second leaky ReLU activation function 908, and a 768×3×3/1 conditional convolution layer 610. The system processes the output of the layer 910 and the output 916 through a Concat function, which generates an output that is processed by a 1280×1×1/1 conditional convolution layer 918, a third leaky ReLU activation function 920, a 1024×1×1/1 conditional convolution layer 922, and a fourth leaky ReLU activation function 924 to produce out 926. The system then processes the output 926 through a first 384×1×1/1 conditional convolution layer 928 and a second 384×1×1/1 conditional convolution layer 930. The output of the first 384×1×1/1 conditional convolution layer 928 is processed through a ReLU activation function 932, and the output 931 of the ReLU activation function and the output 933 of the second 384×1×1/1 conditional convolution layer 930 and processed through a Gaussian density model 934.

The system processes the output 936 of the Gaussian density model 934 and the output 620 from the conditional encoder 600 with an autoencoder (AE) 938, which generates a signal that is processed through a quantization table 939. The system processes the output of the quantization table 939 and the output 936 of the Gaussian density model 934 with the decoder 940 to generate the output 942.

FIG. 10 illustrates a conditional decoder 1000, according to an embodiment. The conditional decoder 1000 may be similar to the conditional decoder 160 depicted in FIG. 1B. The decoder 1000 receives the output 826 and processes it through a first 192×5×5/2 conditional convolution layer 1002, a first leaky ReLU activation function 1004, a second 192×5×5/2 conditional convolution layer 1006, a second leaky ReLU activation function 1008, a 192×3×3 conditional convolution layer 1010 and a third leaky ReLY activation function 1012 to produce output 1014.

FIG. 11 illustrates a conditional decoder 1100, according to an embodiment. The conditional decoder 1100 may be similar to the decoder 104 depicted in FIG. 1A and the decoder 162 depicted in FIG. 1B. The decoder receives the output 1014 and the output 940 and processes the outputs at a concat function 1102. The system processes the output of the concat function 1102 to a first 192×5×5/2 conditional convolution layer 1104, a first inverse generalized divisive normalization (IGDN) layer 1106, a second 192×5×5/2 conditional convolution layer 1108, a second IGDN layer 1110, a third 192×5×5/2 conditional convolution layer 1112, a third IGDN layer 1114 and a 3×5×5/2 conditional convolution layer 1116 to produce a reconstructed input 1118.

FIG. 12 illustrates an electronic device 1201 in a network environment 1100, according to one embodiment. Referring to FIG. 12, the electronic device 1201 in the network environment 1200 may communicate with an electronic device 1202 via a first network 1298 (e.g., a short-range wireless communication network), or an electronic device 1204 or a server 1208 via a second network 1299 (e.g., a long-range wireless communication network). The electronic device 1201 may communicate with the electronic device 1204 via the server 1208. The electronic device 1201 may include a processor 1220, a memory 1230, an input device 1250, a sound output device 1255, a display device 1260, an audio module 1270, a sensor module 1276, an interface 1277, a haptic module 1279, a camera module 1280, a power management module 1288, a battery 1289, a communication module 1290, a subscriber identification module (SIM) 1296, or an antenna module 1297. In one embodiment, at least one (e.g., the display device 1260 or the camera module 1280) of the components may be omitted from the electronic device 1201, or one or more other components may be added to the electronic device 1201. In one embodiment, some of the components may be implemented as a single integrated circuit (IC). For example, the sensor module 1276 (e.g., a fingerprint sensor, an iris sensor, or an illuminance sensor) may be embedded in the display device 1260 (e.g., a display).

The processor 1220 may execute, for example, software (e.g., a program 1240) to control at least one other component (e.g., a hardware or a software component) of the electronic device 1201 coupled with the processor 1220, and may perform various data processing or computations. As at least part of the data processing or computations, the processor 1220 may load a command or data received from another component (e.g., the sensor module 1276 or the communication module 1290) in volatile memory 1232, process the command or the data stored in the volatile memory 1232, and store resulting data in non-volatile memory 1234. The processor 1220 may include a main processor 1221 (e.g., a central processing unit (CPU) or an application processor (AP)), and an auxiliary processor 1223 (e.g., a graphics processing unit (GPU), an image signal processor (ISP), a sensor hub processor, or a communication processor (CP)) that is operable independently from, or in conjunction with, the main processor 1221. Additionally or alternatively, the auxiliary processor 1223 may be adapted to consume less power than the main processor 1221, or execute a particular function. The auxiliary processor 1223 may be implemented as being separate from, or a part of, the main processor 1221.

The auxiliary processor 1223 may control at least some of the functions or states related to at least one component (e.g., the display device 1260, the sensor module 1276, or the communication module 1290) among the components of the electronic device 1201, instead of the main processor 1221 while the main processor 1221 is in an inactive (e.g., sleep) state, or together with the main processor 1221 while the main processor 1221 is in an active state (e.g., executing an application). According to one embodiment, the auxiliary processor 1223 (e.g., an image signal processor or a communication processor) may be implemented as part of another component (e.g., the camera module 1280 or the communication module 1290) functionally related to the auxiliary processor 1223.

The memory 1230 may store various data used by at least one component (e.g., the processor 1220 or the sensor module 1276) of the electronic device 1201. The various data may include, for example, software (e.g., the program 1240) and input data or output data for a command related thereto. The memory 1230 may include the volatile memory 1232 or the non-volatile memory 1234.

The program 1240 may be stored in the memory 1230 as software, and may include, for example, an operating system (OS) 1242, middleware 1244, or an application 1246.

The input device 1250 may receive a command or data to be used by other component (e.g., the processor 1220) of the electronic device 1201, from the outside (e.g., a user) of the electronic device 1201. The input device 1250 may include, for example, a microphone, a mouse, or a keyboard.

The sound output device 1255 may output sound signals to the outside of the electronic device 1201. The sound output device 1255 may include, for example, a speaker or a receiver. The speaker may be used for general purposes, such as playing multimedia or recording, and the receiver may be used for receiving an incoming call. According to one embodiment, the receiver may be implemented as being separate from, or a part of, the speaker.

The display device 1260 may visually provide information to the outside (e.g., a user) of the electronic device 1201. The display device 1260 may include, for example, a display, a hologram device, or a projector and control circuitry to control a corresponding one of the display, hologram device, and projector. According to one embodiment, the display device 1260 may include touch circuitry adapted to detect a touch, or sensor circuitry (e.g., a pressure sensor) adapted to measure the intensity of force incurred by the touch.

The audio module 1270 may convert a sound into an electrical signal and vice versa. According to one embodiment, the audio module 1270 may obtain the sound via the input device 1250, or output the sound via the sound output device 1255 or a headphone of an external electronic device 1202 directly (e.g., wired) or wirelessly coupled with the electronic device 1201.

The sensor module 1276 may detect an operational state (e.g., power or temperature) of the electronic device 1201 or an environmental state (e.g., a state of a user) external to the electronic device 1201, and then generate an electrical signal or data value corresponding to the detected state. The sensor module 1276 may include, for example, a gesture sensor, a gyro sensor, an atmospheric pressure sensor, a magnetic sensor, an acceleration sensor, a grip sensor, a proximity sensor, a color sensor, an infrared (IR) sensor, a biometric sensor, a temperature sensor, a humidity sensor, or an illuminance sensor.

The interface 1277 may support one or more specified protocols to be used for the electronic device 1201 to be coupled with the external electronic device 1202 directly (e.g., wired) or wirelessly. According to one embodiment, the interface 1277 may include, for example, a high definition multimedia interface (HDMI), a universal serial bus (USB) interface, a secure digital (SD) card interface, or an audio interface.

A connecting terminal 1278 may include a connector via which the electronic device 1201 may be physically connected with the external electronic device 1202. According to one embodiment, the connecting terminal 1278 may include, for example, an HDMI connector, a USB connector, an SD card connector, or an audio connector (e.g., a headphone connector).

The haptic module 1279 may convert an electrical signal into a mechanical stimulus (e.g., a vibration or a movement) or an electrical stimulus which may be recognized by a user via tactile sensation or kinesthetic sensation. According to one embodiment, the haptic module 1279 may include, for example, a motor, a piezoelectric element, or an electrical stimulator.

The camera module 1280 may capture a still image or moving images. According to one embodiment, the camera module 1280 may include one or more lenses, image sensors, image signal processors, or flashes.

The power management module 1288 may manage power supplied to the electronic device 1201. The power management module 1288 may be implemented as at least part of, for example, a power management integrated circuit (PMIC).

The battery 1289 may supply power to at least one component of the electronic device 1201. According to one embodiment, the battery 1289 may include, for example, a primary cell which is not rechargeable, a secondary cell which is rechargeable, or a fuel cell.

The communication module 1290 may support establishing a direct (e.g., wired) communication channel or a wireless communication channel between the electronic device 1201 and the external electronic device (e.g., the electronic device 1202, the electronic device 1204, or the server 1208) and performing communication via the established communication channel. The communication module 1290 may include one or more communication processors that are operable independently from the processor 1220 (e.g., the AP) and supports a direct (e.g., wired) communication or a wireless communication. According to one embodiment, the communication module 1290 may include a wireless communication module 1292 (e.g., a cellular communication module, a short-range wireless communication module, or a global navigation satellite system (GNSS) communication module) or a wired communication module 1294 (e.g., a local area network (LAN) communication module or a power line communication (PLC) module). A corresponding one of these communication modules may communicate with the external electronic device via the first network 1298 (e.g., a short-range communication network, such as Bluetooth™, wireless-fidelity (Wi-Fi) direct, or a standard of the Infrared Data Association (IrDA)) or the second network 1299 (e.g., a long-range communication network, such as a cellular network, the Internet, or a computer network (e.g., LAN or wide area network (WAN)). These various types of communication modules may be implemented as a single component (e.g., a single IC), or may be implemented as multiple components (e.g., multiple ICs) that are separate from each other. The wireless communication module 1292 may identify and authenticate the electronic device 1201 in a communication network, such as the first network 1298 or the second network 1299, using subscriber information (e.g., international mobile subscriber identity (IMSI)) stored in the subscriber identification module 1296.

The antenna module 1297 may transmit or receive a signal or power to or from the outside (e.g., the external electronic device) of the electronic device 1201. According to one embodiment, the antenna module 1297 may include one or more antennas, and, therefrom, at least one antenna appropriate for a communication scheme used in the communication network, such as the first network 1298 or the second network 1299, may be selected, for example, by the communication module 1290 (e.g., the wireless communication module 1292). The signal or the power may then be transmitted or received between the communication module 1290 and the external electronic device via the selected at least one antenna.

At least some of the above-described components may be mutually coupled and communicate signals (e.g., commands or data) therebetween via an inter-peripheral communication scheme (e.g., a bus, a general purpose input and output (GPIO), a serial peripheral interface (SPI), or a mobile industry processor interface (MIPI)).

According to one embodiment, commands or data may be transmitted or received between the electronic device 1201 and the external electronic device 1204 via the server 1208 coupled with the second network 1299. Each of the electronic devices 1202 and 1204 may be a device of a same type as, or a different type, from the electronic device 1201. All or some of operations to be executed at the electronic device 1201 may be executed at one or more of the external electronic devices 1202, 1204, or 1208. For example, if the electronic device 1201 should perform a function or a service automatically, or in response to a request from a user or another device, the electronic device 1201, instead of, or in addition to, executing the function or the service, may request the one or more external electronic devices to perform at least part of the function or the service. The one or more external electronic devices receiving the request may perform the at least part of the function or the service requested, or an additional function or an additional service related to the request, and transfer an outcome of the performing to the electronic device 1201. The electronic device 1201 may provide the outcome, with or without further processing of the outcome, as at least part of a reply to the request. To that end, a cloud computing, distributed computing, or client-server computing technology may be used, for example.

One embodiment may be implemented as software (e.g., the program 1240) including one or more instructions that are stored in a storage medium (e.g., internal memory 1236 or external memory 1238) that is readable by a machine (e.g., the electronic device 1201). For example, a processor of the electronic device 1101 may invoke at least one of the one or more instructions stored in the storage medium, and execute it, with or without using one or more other components under the control of the processor. Thus, a machine may be operated to perform at least one function according to the at least one instruction invoked. The one or more instructions may include code generated by a complier or code executable by an interpreter. A machine-readable storage medium may be provided in the form of a non-transitory storage medium. The term “non-transitory” indicates that the storage medium is a tangible device, and does not include a signal (e.g., an electromagnetic wave), but this term does not differentiate between where data is semi-permanently stored in the storage medium and where the data is temporarily stored in the storage medium.

According to one embodiment, a method of the disclosure may be included and provided in a computer program product. The computer program product may be traded as a product between a seller and a buyer. The computer program product may be distributed in the form of a machine-readable storage medium (e.g., a compact disc read only memory (CD-ROM)), or be distributed (e.g., downloaded or uploaded) online via an application store (e.g., Play Store™), or between two user devices (e.g., smart phones) directly. If distributed online, at least part of the computer program product may be temporarily generated or at least temporarily stored in the machine-readable storage medium, such as memory of the manufacturer's server, a server of the application store, or a relay server.

According to one embodiment, each component (e.g., a module or a program) of the above-described components may include a single entity or multiple entities. One or more of the above-described components may be omitted, or one or more other components may be added. Alternatively or additionally, a plurality of components (e.g., modules or programs) may be integrated into a single component. In this case, the integrated component may still perform one or more functions of each of the plurality of components in the same or similar manner as they are performed by a corresponding one of the plurality of components before the integration. Operations performed by the module, the program, or another component may be carried out sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations may be executed in a different order or omitted, or one or more other operations may be added.

Although certain embodiments of the present disclosure have been described in the detailed description of the present disclosure, the present disclosure may be modified in various forms without departing from the scope of the present disclosure. Thus, the scope of the present disclosure shall not be determined merely based on the described embodiments, but rather determined based on the accompanying claims and equivalents thereto. 

What is claimed is:
 1. A method for compression, comprising: determining a modulation coding scheme (MCS) from among a plurality of MCSs included in a lookup table; selecting, from the lookup table, a Lagrange multiplier that corresponds to the determined MCS in the lookup table; training an autoencoder using the Lagrange multiplier; implementing the trained autoencoder into a network; and training the network including the trained autoencoder with quantization.
 2. The method of claim 1, wherein a value of the Lagrange multiplier is selected from a predetermined set of values.
 3. The method of claim 1, wherein the network produces a compressed output with a varying compression rate and distortion depending on a conditioning value of the Lagrange multiplier.
 4. The method of claim 1, wherein the autoencoder is trained using conditional convolution.
 5. The method of claim 1, wherein training the network further comprises training the network with mixed quantization bin sizes.
 6. The method of claim 5, wherein training the network with mixed quantization bin sizes further comprises drawing a uniform noise for various noise levels for random quantization bin sizes.
 7. The method of claim 1, wherein training the network further comprises encoding a latent representation of an input.
 8. The method of claim 7, wherein training the network further comprises quantizing the encoded latent representation with a selected quantization bit size.
 9. The method of claim 1, wherein training the network further comprises encoding a quantized latent representation with entropy encoding.
 10. A system, comprising: a network; and a processor configured to: determine a modulation coding scheme (MCS) from among a plurality of MCSs included in a lookup table, selecting, from the lookup table, a Lagrange multiplier that corresponds to the determined MCS in the lookup table; train an autoencoder using the Lagrange multiplier; implementing the trained autoencoder into the network; and train the network including the autoencoder using quantization.
 11. The system of claim 10, wherein a value of the Lagrange multiplier is selected from a predetermined set of values.
 12. The system of claim 10, wherein the network produces a compressed output with varying compression rate and distortion depending on a conditioning value of the Lagrange multiplier.
 13. The system of claim 10, wherein the autoencoder is trained using conditional convolution.
 14. The system of claim 10, wherein the processor is further configured to train the network by training the network with mixed quantization bin sizes.
 15. The system of claim 14, wherein the processor is configured to train the network with mixed quantization bin sizes by drawing a uniform noise for various noise levels for random quantization bin sizes.
 16. The system of claim 10, wherein the processor is further configured to train the network by encoding a latent representation of an input.
 17. The system of claim 16, wherein the processor is further configured to train the network by quantizing the encoded latent representation with a selected quantization bit size.
 18. The system of claim 10, wherein the processor is further configured to train the network by encoding a quantized latent representation with entropy encoding. 